Effective Choice and Boundedness Principles in Computable Analysis
نویسندگان
چکیده
منابع مشابه
Effective Choice and Boundedness Principles in Computable Analysis
In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can be continuously or computably transferred into each other? For this purpose theorems are considered via their realizers which are operations with certain input and output data. The technical tool to express continuous or compu...
متن کاملSub-computable Boundedness Randomness
This paper defines a new notion of bounded computable randomness for certain classes of sub-computable functions which lack a universal machine. In particular, we define such versions of randomness for primitive recursive functions and for PSPACE functions. These new notions are robust in that there are equivalent formulations in terms of (1) Martin-Löf tests, (2) Kolmogorov complexity, and (3)...
متن کاملComputable Versions of the Uniform Boundedness Theorem
We investigate the computable content of the Uniform Boundedness Theorem and of the closely related Banach-Steinhaus Theorem. The Uniform Boundedness Theorem states that a pointwise bounded sequence of bounded linear operators on Banach spaces is also uniformly bounded. But, given the sequence, can we also effectively find the uniform bound? It turns out that the answer depends on how the seque...
متن کاملComputable choice functions for computable linear orderings
One direction of research in computability theory is the study of the effective content of combinatorial theorems. The last chapter of Rosenstein’s book [2] reports on this type of investigation for linear orderings. Questions raised in that chapter have been the subject of a number of papers, and a summary of results in the area can be found in Downey [1]. In this paper, we consider the proble...
متن کاملComputable Functors and Effective interpretability
Our main result is the equivalence of two notions of reducibility between structures. One is a syntactical notion which is an effective version of interpretability as in model theory, and the other one is a computational notion which is a strengthening of the wellknown Medvedev reducibility. We extend our result to effective biinterpretability and also to effective reductions between classes of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Bulletin of Symbolic Logic
سال: 2011
ISSN: 1079-8986,1943-5894
DOI: 10.2178/bsl/1294186663